منابع مشابه
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts – including ranking websites – and can be interpreted as the average portion of time spent at the node by an infinite random walk. We consider the problem of maximizing the PageRank of a node by selecting some of the edges from a set of edges that are ...
متن کاملPolynomial Stochastic Hybrid Systems
Abstract. This paper deals with polynomial stochastic hybrid systems (pSHSs), which generally correspond to stochastic hybrid systems with polynomial continuous vector fields, reset maps, and transition intensities. For pSHSs, the dynamics of the statistical moments of the continuous states evolve according to infinitedimensional linear ordinary differential equations (ODEs). We show that these...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملOn Hermitian Polynomial Optimization
We compare three levels of algebraic certificates for evaluating the maximum modulus of a complex analytic polynomial, on a compact semialgebraic set. They are obtained as translations of some recently discovered inequalities in operator theory. Although they can be stated in purely algebraic terms, the only known proofs for these decompositions have a transcendental character.
متن کاملOptimization of Polynomial Functions
Recently progress has been made in the development of algorithms for optimizing polynomials. The main idea being stressed is that of reducing the problem to an easier problem involving semidefinite programming [18]. It seems that in many cases the method dramatically outperforms other existing methods. The idea traces back to work of Shor [16][17] and is further developed by Parrilo [10] and by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 2019
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556788.2019.1649672